Pattern skeletonization using run-length-wise processing for intersection distortion problem
نویسندگان
چکیده
منابع مشابه
Pattern skeletonization using run-length-wise processing for intersection distortion problem
Existing skeletonization methods are largely pixel-wise methods which present problems at line pattern intersection regions. Challenged by the problems, we have developed a run-length-wise method in vectorizing line pattern intersections and solving intersection distortion problem in skeletonization. We experimented the method with handwritten Chinese character and numeral character skeletoniza...
متن کاملPattern Run - Length for Test Data Compression
This paper presents a new pattern run-length compression method whose decompressor is simple and easy to implement. It encodes 2|n| runs of compatible or inversely compatible patterns, either inside a single test data segment or across multiple test data segments. Experimental results show that it can achieve an average compression ratio of 67.64% and considerable test application time savings.
متن کاملRun-length Based Compression for Selective Unspecified Test Pattern
In all System-on-a-Chip (SoC) designs, there is a necessity to reduce the large test data volume and this is achieved by test data compression. One of the methods is the variable-to-variable length compression method. A selective run-length based compression which comes under variable-to-variable method is presented in this paper. The proposed work is based on threshold calculation on don’t car...
متن کامل$2^{n}$ Pattern Run-Length for Test Data Compression
This paper presents a pattern run-length compression method. Compression is conducted by encoding 2 runs of compatible or inversely compatible patterns into codewords in both views either inside a single segment or across multiple segments. With the provision of high compression flexibility, this method can achieve significant compression. Experimental results for the large ISCAS’89 benchmark c...
متن کاملEnhanced Constrained Run-Length Algorithm for Complex Layout Document Processing
The Constrained Run-Length Algorithm (CRLA) is a well-known technique for page segmentation. The algorithm is very efficient for partitioning documents with Manhattan layouts but not suited to deal with complex layout pages, e.g. irregular graphics embedded in a text paragraph. Its main drawback is to use only local information during the smearing stage, which may lead to erroneous linkage of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 1999
ISSN: 0167-8655
DOI: 10.1016/s0167-8655(99)00047-1